Test Plait Generatiom Using Formal Grammars*
نویسندگان
چکیده
A test plan generation algorithm is proposed for systems such as process-control systems or transactionprocessing systems. Input to the algorithm is a description of the functional requirements for a given system. This is converted to an augmented finite state automaton (fsa) from which a regular grammar is derived. The grammar is used to generate test "sentences" each of which describes a sequence of stimuli to be applied to the system under test and responses required of the system under test.
منابع مشابه
Software Support for Formal Languages Courses
An introductory formal languages course exposes students to automata theory, grammars, constructive proofs, computability, and decidability. This exposure usually comes late in the undergraduate curriculum or early in the graduate curriculum. In either setting, programming-oriented students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science...
متن کاملMetric-Driven Grammars and Morphogenesis
Expansion of space, rather than the progress of time, drives many developmental processes in plants. Metric-driven grammars provide a formal method for specifying and simulating such processes. We illustrate their operation using cell division patterns, phyllotactic patterns, and several aspects of leaf development.
متن کاملFunctional Automata - Formal Languages for Computer Science Students
An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science. The existence of this perception is not completely absurd since students are asked to ...
متن کاملEfficient Model-based Fuzz Testing Using Higher-order Attribute Grammars
Format specifications of data input are critical to model-based fuzz testing. Present methods cannot describe the format accurately, which leads to high redundancy in testing practices. In order to improve testing efficiency, we propose a grammar-driven approach to fuzz testing. Firstly, we build a formal model of data format using higher-order attribute grammars, and construct syntax tree on t...
متن کاملOn the Expressivity of Linear Transductions
We investigate the formal expressivity properties of linear transductions, the class of transductions generated by linear transduction grammars, linear inversion transduction grammars and preterminalized linear inversion transduction grammars. While empirical results such as those in previous work are of course an ultimate test of modeling adequacy for machine translation applications, it is eq...
متن کامل